Hypocoercivity of piecewise deterministic Markov process-Monte Carlo

نویسندگان

چکیده

In this work, we establish L2-exponential convergence for a broad class of piecewise deterministic Markov processes recently proposed in the context process Monte Carlo methods and covering particular randomized Hamiltonian (Trans. Amer. Math. Soc. 367 (2015) 3807–3828; Ann. Appl. Probab. 27 (2017) 2159–2194), zig-zag (Ann. Statist. 47 (2019) 1288–1320) bouncy particle Sampler (Phys. Rev. E 85 (2012) 026703; J. Assoc. 113 (2018) 855–867). The kernel symmetric part generator such is nontrivial, follow ideas introduced (C. R. Acad. Sci. Paris 347 (2009) 511–516; Trans. 3807–3828) to develop rigorous framework hypocoercivity fairly general unifying set-up, while deriving tractable estimates constants involved terms parameters dynamics. As by-product characterize scaling properties these algorithms with respect dimension classes problems, therefore providing some theoretical evidence support their practical relevance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo

Recently there have been conceptually new developments in Monte Carlo methods through the introduction of new MCMC and sequential Monte Carlo (SMC) algorithms which are based on continuous-time, rather than discrete-time, Markov processes. This has led to some fundamentally new Monte Carlo algorithms which can be used to sample from, say, a posterior distribution. Interestingly, continuous-time...

متن کامل

Piecewise-deterministic Markov Processes for Sequential Monte Carlo and MCMC∗

This talk will introduce piecewise-deterministic Markov processes, and show how they can be used to develop novel, continuous-time, variants of MCMC or SMC. A particular motivation for this work is to develop Monte Carlo methods that can sample from a posterior and that scale well to large-data.

متن کامل

Markov Chain Monte Carlo

Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...

متن کامل

Markov Chain Monte Carlo

This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with the basic theory of Markov chains and build up to a theorem that characterizes convergent chains. We then discuss the MetropolisHastings algorithm.

متن کامل

Markov chain Monte Carlo

One of the simplest and most powerful practical uses of the ergodic theory of Markov chains is in Markov chain Monte Carlo (MCMC). Suppose we wish to simulate from a probability density π (which will be called the target density) but that direct simulation is either impossible or practically infeasible (possibly due to the high dimensionality of π). This generic problem occurs in diverse scient...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Applied Probability

سال: 2021

ISSN: ['1050-5164', '2168-8737']

DOI: https://doi.org/10.1214/20-aap1653